Efficient Multiple-Valued Model-Checking Using Lattice Representations
نویسندگان
چکیده
Multiple-valued logics can be effectively used to reason about incomplete and/or inconsistent systems, e.g. during early software requirements or as the systems evolve. We specify multiple-valued logics using finite lattices. In this paper, we use lattice representation theory to cast the multiple-valued modelchecking problem in terms of symbolic operations on classical sets of states, provided the lattices are distributive. This allows us to partially reuse existing symbolic model-checking technology and improve efficiency over previous implementations that were based on multiple-valued decision diagrams.
منابع مشابه
Consistent Partial Model Checking
We propose assertion-consistency (AC) semi-lattices as suitable orders for the analysis of partial models. Such orders express semantic entailment, multiple-viewpoint and multiple-valued analysis, maintain internal consistency of reasoning, and subsume finite De Morgan lattices. We classify those orders that are finite and distributive and apply them to design an efficient algorithm for multipl...
متن کاملRepresentations and Characterizations of Polynomial Functions on Chains
We are interested in representations and characterizations of lattice polynomial functions f : L → L, where L is a given bounded distributive lattice. In a companion paper [4], we investigated certain representations and provided various characterizations of these functions both as solutions of certain functional equations and in terms of necessary and sufficient conditions. In the present pape...
متن کاملModel Checking with Multi-valued Logics
In multi-valued model checking, a temporal logic formula is interpreted relative to a structure not as a truth value but as a lattice element. In this paper we present new algorithms for multi-valued model checking. We first show how to reduce multi-valued model checking with any distributive DeMorgan lattice to standard, two-valued model checking. We then present a direct, automata-theoretic a...
متن کاملAutomated Paraconsistent Reasoning via Model Checking
Inconsistency is a pervasive problem in software engineering, where different aspects of a system are described in separate models. Resolving all the inconsistencies in a large set of models is often infeasible, in which case automated reasoning tools based on classical logic have limited application. In this paper we describe an automated tool for paraconsistent reasoning, using multi-valued l...
متن کاملData Envelopment Analysis from simulation on the Lattice QCD using CCR model
One of the most serious principles in production theory in economic is the principle of "efficiency". Simply put, efficiency can be defined as the demand that the desired goals (outputs) are achieved with the minimum use of the available resources (inputs). In order to, distinguish the relative efficiency of organizational units with multiple inputs to produce multiple outputs, "Data Envelopmen...
متن کامل